Minimal dilatation in Penner’s construction
نویسندگان
چکیده
منابع مشابه
Construction of Minimal Cocycles
Blending methods of Topological Dynamics and Control Theory, we develop a new technique to construct compact-Lie-group-valued minimal cocycles arising as fundamental matrix solutions of linear diierential equations with recurrent coeecients subject to a given constraint. The precise requirement on the coee-cients is that they belong to a speciied closed convex subset S of the Lie algebra L of t...
متن کاملA construction algorithm for minimal surfaces
2014 Infinite periodic minimal surfaces are constructed from complex functions, which are simply related to the orientation of flat points on the surface. Two tetragonal families of surfaces are generated, which are shown to reduce in special cases to classical minimal surfaces : the cubic diamond surface (D surface) and the Scherk surface. In all cases the construction algorithm for the comple...
متن کاملMinimal trellis construction from convolutional ring encoders
The paper addresses minimality of encoders for basic convolutional codes over Zpr by using a recently developed concept of row reducedness for polynomial matrices over Zpr . It is known in the literature that the McMillan degree of a basic encoder is an upper bound for the minimum number of trellis states, but a general expression is missing. This open problem is solved in this paper. An expand...
متن کاملConstruction of Triply Periodic Minimal Surfaces
We discuss the construction of triply period minimal surfaces. This includes concepts for constructing new examples as well as a discussion of numerical computations based on the new concept of discrete minimal surfaces. As a result we present a wealth of old and new examples and suggest directions for further generalizations.
متن کاملConstruction of harmonic diffeomorphisms and minimal graphs
We study complete minimal graphs in IH × IR, which take asymptotic boundary values plus and minus infinity on alternating sides of an ideal inscribed polygon Γ in IH. We give necessary and sufficient conditions on the ”lenghts” of the sides of the polygon (and all inscribed polygons in Γ) that ensure the existence of such a graph. We then apply this to construct entire minimal graphs in IH× IR ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2017
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/13521